Counting value sets: algorithm and complexity
نویسندگان
چکیده
منابع مشابه
Counting Value Sets: Algorithm and Complexity
Let p be a prime. Given a polynomial in Fpm [x] of degree d over the finite field Fpm , one can view it as a map from Fpm to Fpm , and examine the image of this map, also known as the value set. In this paper, we present the first non-trivial algorithm and the first complexity result on explicitly computing the cardinality of this value set. We show an elementary connection between this cardina...
متن کاملCounting Complexity Classes for Numeric Computations. III: Complex Projective Sets
In [7] counting complexity classes #PR and #PC in the BlumShub-Smale setting of computations over the real and complex numbers, respectively, were introduced. One of the main results of [7] is that the problem to compute the Euler characteristic of a semialgebraic set is complete in the class FPR R . In this paper, we prove that the corresponding result is true over C, namely that the computati...
متن کاملCounting Complexity Classes for Numeric Computations I: Semilinear Sets
We define a counting class #Padd in the Blum-Shub-Smale-setting of additive computations over the reals. Structural properties of this class are studied, including a characterization in terms of the classical counting class #P introduced by Valiant. We also establish transfer theorems for both directions between the real additive and the discrete setting. Then we characterize in terms of comple...
متن کاملExponential Time Complexity of Weighted Counting of Independent Sets
We consider weighted counting of independent sets using a rational weight x: Given a graph with n vertices, count its independent sets such that each set of size k contributes xk. This is equivalent to computation of the partition function of the lattice gas with hard-core self-repulsion and hard-core pair interaction. We show the following conditional lower bounds: If counting the satisfying a...
متن کاملAn Efficient Parallel and Distributed Algorithm for Counting Frequent Sets
Due to the huge increase in the number and dimension of available databases, efficient solutions for counting frequent sets are nowadays very important within the Data Mining community. Several sequential and parallel algorithms were proposed, which in many cases exhibit excellent scalability. In this paper we present ParDCI, a distributed and multithreaded algorithm for counting the occurrence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Book Series
سال: 2013
ISSN: 2329-907X,2329-9061
DOI: 10.2140/obs.2013.1.235